A general architecture of oritatami systems for simulating arbitrary finite automata

Simulating finite automata with context-free grammars

Gap Theorems for the Delay of Circuits Simulating Finite Automata

We study the delay (also known as depth) of circuits that simulate finite automata, showing that only certain growth rates (as a function of the number n of steps simulated) are possible. A classic result due to Ofman (rediscovered and popularized by Ladner and Fischer) says that delay O(log n) is always sufficient. We show that if the automaton is " generalized definite " , then delay O(1) is ...

Simulating Vascular Systems in Arbitrary Anatomies

Better physiological understanding of principles regulating vascular formation and growth is mandatory to their efficient modeling for the purpose of physiologically oriented medical applications like training simulation or pre-operative planning. We have already reported on the implementation of a visually oriented modeling framework allowing to study various physiological aspects of the vascu...

Bisimulation for BL-general fuzzy automata

In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

A Finite Element Model for Simulating Flow around a Well with Helically Symmetric Perforations

In a perforated well, fluids enter the wellbore through array of perforation tunnels. These perforations are typically distributed in a helical pattern around the wellbore. Available numerical models to simulate production flow into cased-and-perforated vertical wells have complicated boundary conditions or suffer from high computational costs. This paper presents a simple and at the same time ...